Dijkstra's algorithm - Wikipedia, the free encyclopedia
ثبت نشده
چکیده
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
منابع مشابه
Vermiculite - Wikipedia, the free encyclopedia
It typically occurs as an alteration product at the contact between felsic and mafic or ultramafic rocks such as pyroxenites and dunites. It also occurs in carbonatites and metamorphosed magenesium rich limestone. Associated mineral phases include: corundum, apatite, serpentine and talc. It occurs interlayered with chlorite, biotite and phlogopite.[2] Vermiculite Wikipedia, the free encyclopedi...
متن کاملTowards Using Wikipedia as a Substitute Corpus for Topic Detection and Metadata Generation in E-Learning
Metadata is crucial for reuse of Learning Resources. Only with good metadata, there is a chance that a Learning Resource can be successfully found in a repository. However, many Learning Resources are still delivered with no or little attached metadata. Automatic metadata generation is used to put things right either as assistance for the author, or as part of a repository’s retrieval functiona...
متن کامل